Cognitive Modelling with Term Rewriting
نویسندگان
چکیده
Term rewriting is a well established formal method used for defining semantics of programming languages, program transformations, automatic theorem proving, symbolic programming, intelligent tutoring system development etc. In this paper, we present a language based on term rewriting as an alternative formalism for modelling cognitive skills. We show how the language overcomes some deficiencies of production systems (compositionality, readability, control-flow etc.) and how, as a consequence, it can help with addressing practical problems raised by the cognitive modelling community.
منابع مشابه
A Minimal OO Calculus for Modelling Biological Systems
In this paper we present a minimal object oriented core calculus for modelling the biological notion of type that arises from biological ontologies in formalisms based on term rewriting. This calculus implements encapsulation, method invocation, subtyping and a simple form of overriding inheritance, and it is applicable to models designed in the most popular term-rewriting formalisms. The class...
متن کاملSome properties of non-orthogonal term graph rewriting systems
This paper examines left-linear non-orthogonal term graph rewriting systems that allow asymmetric connicts between redexes. Using a deenition of compatibility of sequences based on Boudol's work on the semantics of term rewriting, it shows that two properties associated with functional languages are true of such graph rewriting systems. First, that a notion of standard computation can be deened...
متن کاملConcurrent object-oriented programming techniques using term graph rewriting
The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent objectoriented programming techniques exploiting the fine grain highly parallel features of TGRS in a language independent fashion that renders it able to act as the basis for developing specific languages based on object-orientation but also to study and compare existing approache...
متن کاملTowards Modelling Actor-Based Concurrency in Term Rewriting
In this work, we introduce a scheme for modelling actor systems within sequential term rewriting. In our proposal, a TRS consists of the union of three components: the functional part (which is specific of a system), a set of rules for reducing concurrent actions, and a set of rules for defining a particular scheduling policy. A key ingredient of our approach is that concurrent systems are mode...
متن کاملComputing with Terms and Graphs
Research in term and graph rewriting ranges from theoretical questions to practical issues. Computing with graphs handles the sharing of common subexpressions in a natural and seamless way, and improves the efficiency of computations in space and time. Sharing is ubiquitous in several research areas, as witnessed by the modelling of first-and higher-order term rewriting by (acyclic or cyclic) g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017